Size Fair and Homologous Tree Genetic Programming Crossovers
نویسنده
چکیده
Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program size and no detrimental e ect on GP performance. GP search spaces are partitioned by the ridge in the number of program v. their size and depth. A ramped uniform random initialisation is described which straddles the ridge. With subtree crossover trees increase about one level per generation leading to sub-quadratic bloat in length.
منابع مشابه
Size Fair and Homologous Tree Crossovers
Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program size (i.e. less bloat) and no detrimental e ect on GP performance. GP search spaces are partitioned by the ridge in the number of program v. their size and depth. While search e ciency is little e ected by initial conditions, th...
متن کاملGECCO - 99 : Proceedings of the Genetic and Evolutionary Computation Conference
Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program size and no detrimental eeect on GP performance. GP search spaces are partitioned by the ridge in the number of program v. their size and depth. A ramped uniform random initialisation is described which straddles the ridge. With...
متن کاملOn the Search Biases of Homologous Crossover in Linear Genetic Programming and Variable-length Genetic Algorithms
With a schema-theoretic approach and experiments we study the search biases produced by GP/GA homologous crossovers when applied to linear, variable-length representations. By specialising the schema theory for homologous crossovers we show that these operators are unbiased with respect to string length. Then, we provide a fixed point for the schema evolution equations where the population pres...
متن کاملOn The Search Biases Of Homologuous Crossover In Linear Genetic Programming And Variable-length Genetic Algorithms
In this paper we study with a schema-theoretic approach and experiments the search biases produced by GP/GA homologous crossovers when applied to linear, variable-length representations. By specialising the schema theory for homologous crossovers we show that these operators are totally unbiased with respect to string length. Then, we provide a fixed point for the schema evolution equations whe...
متن کاملGenetic algorithm for Echo cancelling
In this paper, echo cancellation is done using genetic algorithm (GA). The genetic algorithm is implemented by two kinds of crossovers; heuristic and microbial. A new procedure is proposed to estimate the coefficients of adaptive filters used in echo cancellation with combination of the GA with Least-Mean-Square (LMS) method. The results are compared for various values of LMS step size and diff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999